10 research outputs found
Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints
In this thesis, we consider the problem of characterizing and enumerating
sets of polyominoes described in terms of some constraints, defined either by
convexity or by pattern containment. We are interested in a well known subclass
of convex polyominoes, the k-convex polyominoes for which the enumeration
according to the semi-perimeter is known only for k=1,2. We obtain, from a
recursive decomposition, the generating function of the class of k-convex
parallelogram polyominoes, which turns out to be rational. Noting that this
generating function can be expressed in terms of the Fibonacci polynomials, we
describe a bijection between the class of k-parallelogram polyominoes and the
class of planted planar trees having height less than k+3. In the second part
of the thesis we examine the notion of pattern avoidance, which has been
extensively studied for permutations. We introduce the concept of pattern
avoidance in the context of matrices, more precisely permutation matrices and
polyomino matrices. We present definitions analogous to those given for
permutations and in particular we define polyomino classes, i.e. sets downward
closed with respect to the containment relation. So, the study of the old and
new properties of the redefined sets of objects has not only become
interesting, but it has also suggested the study of the associated poset. In
both approaches our results can be used to treat open problems related to
polyominoes as well as other combinatorial objects.Comment: PhD thesi
Énumération de polyominos définis en terme d'évitement de motif ou de contraintes de convexité
In this thesis, we consider the problem of characterising and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well-known subclass of convex polyominoes, the k-convex polyominoes for which the enumeration according to the semi-perimeter is known only for k=1,2. We obtain, from recursive decomposition, the generating function of the class of k-convex parallelogram polyominoes, which turns out to be rational. Noting that this generating function can be expressed in terms of the Fibonacci polynomials, we describe a bijection between the class of k-parallelogram polyominoes and the class of planted planar trees having height less than k+3. In the second part of the thesis we examine the notion of pattern avoidance, which has been extensively studied for permutations. We introduce the concept of pattern avoidance in the context of matrices, more precisely permutation matrices and polyomino matrices. We present definitions analogous to those given for permutations and in particular we define polyomino classes, i.e. sets downward closed with respect to the containment relation. So, the study of the old and new properties of the redefined sets of objects has not only become interesting, but it has also suggested the study of the associated poset. In both approaches our results can be used to treat open problems related to polyominoes as well as other combinatorial objects.Dans cette thèse nous étudions la caractérisation et l'énumération de polyominos définis par des contraintes de convexité et ou d'évitement de motifs. Nous nous intéressons à l'énumération des polyominos k-convexes selon le semi périmètre, qui n'était connue que pour k=1,2. Nous énumérons une sous classe, les polyominos k-parallélogrammes, grâce à une décomposition récursive dont nous déduisons la fonction génératrice qui est rationnelle. Cette fonction génératrice s'exprime à l'aide des polynômes de Fibonacci, ce qui nous permet d'en déduire une bijection avec les arbres planaires ayant une hauteur inférieure ou égale à k+2. Dans la deuxième partie, nous examinons la notion d'évitement de motif, qui a été essentiellement étudiée pour les permutations. Nous introduisons ce concept dans le contexte de matrices de permutations et de polyominos. Nous donnons des définitions analogues à celles données pour les permutations et nous explorons ses propriétés ainsi que celles du poste associé. Ces deux approches peuvent être utilisées pour traiter des problèmes ouverts sur les polyominos ou sur d'autres objets combinatoires
The Identity Transform of a Permutation and its Applications
Starting from a Theorem by Hall, we define the identity transform of a permutation Ï\u80 as C(Ï\u80) = (0+Ï\u80(0), 1+Ï\u80(1), â\u8b¯, (n-1)+Ï\u80(n.1)), and we define the set Cn = (C(Ï\u80) : Ï\u80 â\u88\u88 Sn, where Sn is the set of permutations of the elements of the cyclic group â\u84¤n. In the first part of this paper we study the set Cn: we show some closure properties of this set, and then provide some of its combinatorial and algebraic characterizations and connections with other combinatorial structures. In the second part of the paper, we use some of the combinatorial properties we have determined to provide a different algorithm for the proof of Hall's Theorem
Permutation classes and polyomino classes with excluded submatrices
This article introduces an analogue of permutation classes in the context of polyominoes. For both permutation classes and polyomino classes, we present an original way of characterizing them by avoidance constraints (namely, with excluded submatrices) and we discuss how canonical such a description by submatrix-avoidance can be. We provide numerous examples of permutation and polyomino classes which may be defined and studied from the submatrix-avoidance point of view, and conclude with various directions for future research on this topic
The number of k-parallelogram polyominoes
International audienceA convex polyomino is - if every pair of its cells can be connected by means of a , internal to the polyomino, and having at most changes of direction. The number -convex polyominoes of given semi-perimeter has been determined only for small values of , precisely . In this paper we consider the problem of enumerating a subclass of -convex polyominoes, precisely the - (briefly, -). For each , we give a recursive decomposition for the class of -parallelogram polyominoes, and then use it to obtain the generating function of the class, which turns out to be a rational function. We are then able to express such a generating function in terms of the .Un polyomino convexe est dit - lorsqu’on peut relier tout couple de cellules par un chemin monotone ayant au plus changements de direction. Le nombre de polyominos -convexes n’est connu que pour les petites valeurs de . Dans cet article, nous énumérons la sous-classe des polyominos -convexes qui sont également parallélogramme, que nous appelons -. Nous donnons une décomposition récursive de la classe des polyominos -parallélogrammes pour chaque , et en déduisons la fonction génératrice, rationnelle, selon le demi-périmètre. Nous donnons enfin une expression de cette fonction génératrice en termes des
Binary pictures with excluded patterns
 The notion of a pattern within a binary picture (polyomino) has been introduced and studied in [3], and resembles the notion of pattern containment within permutations. The main goal of this paper is to extend the studies of [3] by adopting a more geometrical approach: we use the notion of pattern avoidance in order to recognize or describe families of polyominoes defined by means of geometrical constraints or combinatorial properties. Moreover, we extend the notion of pattern in a polyomino, by introducing generalized polyomino patterns, so that to be able to describe more families of polyominoes known in the literature